Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Improved K-anonymity privacy protection algorithm based on different sensitivities
Ran ZHAI, Xuebin CHEN, Guopeng ZHANG, Langtao PEI, Zheng MA
Journal of Computer Applications    2023, 43 (5): 1497-1503.   DOI: 10.11772/j.issn.1001-9081.2022040552
Abstract353)   HTML9)    PDF (1192KB)(217)       Save

To address the problem that the development of machine learning requires a large number of real datasets with both data security and availability, an improved K-anonymity privacy protection algorithm based on Random Forest (RF) was proposed, namely RFK-anonymity privacy protection. Firstly, the sensitivity of each attribute value was predicted by RF algorithm. Secondly, the attribute values were clustered according to different sensitivities by using the k-means clustering algorithm, and the data was hidden to different degrees by using the K-anonymity algorithm according to the sensitivity clusters of attribution. Finally, data tables with different hiding degrees were selected by different users according to their needs. Experimental results show that in Adult datasets,compared with the data processed by K-anonymity algorithm, the accuracies of the data processed by the RFK-anonymity privacy protection algorithm are increased by 0.5 and 1.6 percentage points at thresholds of 3 and 4, respectively; compared with the data processed by (pαk)-anonymity algorithm, the accuracies of the data processed by the proposed algorithm are improved by 0.4 and 1.9 percentage points at thresholds of 4 and 5. It can be seen that RFK-anonymity privacy protection algorithm can effectively improve the availability of data on the basis of protecting the privacy and security of data, and it is more suitable for classification and prediction in machine learning.

Table and Figures | Reference | Related Articles | Metrics